An analysis of the LRE-Algorithm using Sojourn times
نویسنده
چکیده
The classical method of evaluation of simulations surely is the batch means method, see e.g. [Bratley et al. 1987], giving confidence intervals to express the precision of the simulation results. Unfortunately, it is not suited for rare event simulation techniques, as they do not produce the necessary large batches. As an alternative, the LRE-algorithm has been introduced in [Schreiber 1984], where the lengthy final analysis of its basis has just been given in [Schreiber 1999]. Its name is based on the ‘Limited Relative Error’ that has been chosen to describe the precision of the results. In this paper, we present another, much simpler, analysis of the LRE-algorithm based on sojourn times, which gives a better understanding of the algorithm and clearly exhibits certain limitations. Additionally, it allows to create confidence intervals, and so it is possible to compare the results of the two very different methods.
منابع مشابه
Sojourn Times in the M/PH/1 Processor Sharing Queue
We give in this paper an algorithm to compute the sojourn time distribution in the processor sharing, single server queue with Poisson arrivals and phase type distributed service times. In a first step, we establish the differential system governing the conditional sojourn times probability distributions in this queue, given the number of customers in the different phases of the PH distribution...
متن کاملOn the Sojourn times for Many-queue Head-of-the-line Processor-sharing Systems with Permanent Customers on the Sojourn times for Many-queue Head-of-the-line Processor-sharing Systems with Permanent Customers 1
We consider a single server system consisting of n queues with diierent types of customers (Poisson streams) and k permanent customers. The permanent customers and those at the head of the queues are served in processor-sharing by the service facility (head-of-the-line processor-sharing). The stability condition and a pseudo work conservation law will be given for arbitrary service time distrib...
متن کاملUvA - DARE ( Digital Academic Repository ) Large deviations for sojourn times in processor sharing queues
This paper presents a large deviation analysis of the steady-state sojourn time distribution in the GI/G/1 PS queue. Logarithmic estimates are obtained under the assumption of the service time distribution having a light tail, thus supplementing recent results for the heavy-tailed setting. Our proof gives insight in the way a large sojourn time occurs, enabling the construction of an (asymptoti...
متن کاملUvA - DARE ( Digital Academic Repository ) Large deviations for sojourn times in processor sharing
This paper presents a large deviation analysis of the steady-state sojourn time distribution in the GI/G/1 PS queue. Logarithmic estimates are obtained under the assumption of the service time distribution having a light tail, thus supplementing recent results for the heavy-tailed setting. Our proof gives insight in the way a large sojourn time occurs, enabling the construction of an (asymptoti...
متن کاملAssessment of depth of anesthesia using principal component analysis
A new approach to estimating level of unconsciousness based on Principal Component Analysis (PCA) is proposed. The Electroencephalogram (EEG) data was captured in both Intensive Care Unit (ICU) and operating room, using different anesthetic drugs. Assuming the central nervous system as a 20-tuple source, window length of 20 seconds is applied to EEG. The mentioned window is considered as 20 non...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000